Clique is hard to approximate within n
نویسنده
چکیده
We prove that, unless any problem in NP can be solved in probabilistic polynomial time, for any ǫ > 0, the size of the largest clique in a graph with n nodes is hard to approximate in polynomial time within a factor n. This is done by constructing, for any δ > 0, a probabilistically checkable proof for NP which uses logarithmic randomness and δ amortized free bits.
منابع مشابه
Hardness of approximation of the Balanced Complete Bipartite Subgraph problem
We prove that the Maximum Balanced Complete Bipartite Subgraph (BCBS) problem is hard to approximate within a factor of 2 n) δ for some δ > 0 under the plausible assumption that 3-SAT ∈ DTIME ( 2 3/4+ ) for some > 0. We also show that it is NP -hard to approximate the BCBS problem within a constant factor under the assumption that it is NP -hard to approximate the maximum clique problem within ...
متن کاملClique Is Hard to Approximate within n1-o(1)
It was previously known that Max Clique cannot be approximated in polynomial time within n1− , for any constant > 0, unless NP = ZPP. In this paper, we extend the reductions used to prove this result and combine the extended reductions with a recent result of Samorodnitsky and Trevisan to show that unless NP ⊆ ZPTIME(2 n(log logn) 3/2)), clique cannot be approximated within n1−O(1/ √ log .
متن کاملOn Unapproximable Versions of NP-Complete Problems
We prove that all of Karp’s 21 original NP-complete problems have a version that is hard to approximate. These versions are obtained from the original problems by adding essentially the same simple constraint. We further show that these problems are absurdly hard to approximate. In fact, no polynomial-time algorithm can even approximate log(k) of the magnitude of these problems to within any co...
متن کاملImproved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
In this paper, we present improved inapproximability results for three problems : the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and the problem of coloring a graph with a small chromatic number with a small number of colors. Håstad’s celebrated result [13] shows that the maximum clique size in a graph with n vertices is inappr...
متن کاملPacking Edge-Disjoint Triangles in Given Graphs
Given a graph G, we consider the problem of finding the largest set of edge-disjoint triangles contained in G. We show that even the simpler case of decomposing the edges of a sparse split graph G into edge-disjoint triangles is NP-complete. We show next that the case of a general G can be approximated within a factor of 3 5 in polynomial time, and is NP-hard to approximate within some constant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996